A Motzkin-Straus Type Result for 3-Uniform Hypergraphs
نویسندگان
چکیده
Cheng Zhao∗, Yuejian Peng, Indiana State University In 1965, Motzkin and Straus establishes a remarkable connection between the maximum clique problem and the extrema of the Lagrangian of a graph. It is interesting to study a generalization of the Motzkin-Straus Theorem to hypergraphs. In this paper, we give some Motzkin-Straus type results.
منابع مشابه
A generalization of the Motzkin-Straus theorem to hypergraphs
In 1965,Motzkin and Straus established a remarkable connection between the global maxima of the Lagrangian of a graph G over the standard simplex and the clique number of G. In this paper, we provide a generalization of the Motzkin–Straus theorem to k-uniform hypergraphs (k-graphs). Specifically, given a k-graph G, we exhibit a family of (parameterized) homogeneous polynomials whose local (glob...
متن کاملA Continuous Characterization of Maximal Cliques in k-Uniform Hypergraphs
In 1965 Motzkin and Straus established a remarkable connection between the local/global maximizers of the Lagrangian of a graph G over the standard simplex ∆ and the maximal/maximum cliques of G. In this work we generalize the Motzkin-Straus theorem to k-uniform hypergraphs, establishing an isomorphism between local/global minimizers of a particular function over ∆ and the maximal/maximum cliqu...
متن کاملNew Bounds on the Clique Number of Graphs Based on Spectral Hypergraph Theory
This work introduces new bounds on the clique number of graphs derived from a result due to Sós and Straus, which generalizes the Motzkin-Straus Theorem to a specific class of hypergraphs. In particular, we generalize and improve the spectral bounds introduced byWilf in 1967 and 1986 establishing an interesting link between the clique number and the emerging spectral hypergraph theory field. In...
متن کاملOn Lagrangians of Hypergraphs Containing Dense Subgraphs
Motzkin and Straus established a remarkable connection between the maximum clique and the Lagrangian of a graph in 1965. This connection and its extensions were successfully employed in optimization to provide heuristics for the maximum clique number in graphs. It is useful in practice if similar results hold for hypergraphs. In this paper, we provide upper bounds on the Lagrangian of a hypergr...
متن کاملEMBEDDINGS AND RAMSEY NUMBERS OF SPARSE k-UNIFORM HYPERGRAPHS
Chvátal, Rödl, Szemerédi and Trotter [3] proved that the Ramsey numbers of graphs of bounded maximum degree are linear in their order. In [6, 23] the same result was proved for 3-uniform hypergraphs. Here we extend this result to k-uniform hypergraphs for any integer k ≥ 3. As in the 3-uniform case, the main new tool which we prove and use is an embedding lemma for k-uniform hypergraphs of boun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Graphs and Combinatorics
دوره 29 شماره
صفحات -
تاریخ انتشار 2013